Primal/Dual Spatial Relationships and Applications PRIMAL/DUAL SPATIAL RELATIONSHIPS AND APPLICATIONS
نویسنده
چکیده
It is well known that extraction of the skeleton of a polygon from its outline may aid in the perception or classification of its form. It has also been suggested that the ‘exoskeleton’ may be used to express the relationships between objects in space. A new algorithm has been developed that extracts both the boundary and the skeleton of the spatial representation of an object in one easy step, based on local properties of the Delaunay/Voronoi diagram, without requiring additional information, such as point order or polygon labelling. This displays and preserves the fundamental relationships between the boundary and the skeleton that helps considerably in many cartographic problems. Illustrations include contour map input and terrain visualization; watershed and flow estimation from river network input, and drainage network estimation from basin boundaries; topological reconstruction from scanned map input, and text recognition and placement in cadastral maps. The concept of preservation of the ‘form’ of the skeleton suggests methods for map generalization without significant loss of meaning. Spatial uncertainty may also be addressed in terms of the boundary sampling requirements and permissible locational error without loss of the ability to interpret the basic form, spatial relationships and meaning of the map. Introduction Blum’s Medial Axis Transform In a previous paper (Gold, 1992) we argued that the medial axis transform/skeleton might form part of our perceptual processes. Here we would like to extend that to suggest that given the
منابع مشابه
Quantitative Characterizations of Regularity Properties of Collections of Sets
Several primal and dual quantitative characterizations of regularity properties of collections of sets in normed linear spaces are discussed. Relationships between regularity properties of collections of sets and those of set-valued mappings are provided.
متن کاملA Dual-based Combinatorial Algorithm for Solving Cyclic Optimization Problems
This paper describes Patent Number U.S. 8,046,316 B2, titled “Cyclic Combinatorial Method and System”, issued by the US Patents and Trademarks Office on October 25, 2011. The patent is based on a combinatorial algorithm to solve cyclic optimization problems. First, the algorithm identifies cyclically distinct solutions of such problems by enumerating cyclically distinct combinations of the basi...
متن کاملStrong Abadie CQ, ACQ, calmness and linear regularity
The Abadie CQ (ACQ) for convex inequality systems is a fundamental notion in optimization and approximation theory. In terms of the contingent cone and tangent derivative, we extend the Abadie CQ to more general convex multifunction cases and introduce the strong ACQ for both multifunctions and inequality systems. Some seemly unrelated notions are unified by the new ACQ and strong ACQ. Relation...
متن کاملNonlinear Metric Subregularity
In this article, we investigate nonlinear metric subregularity properties of set-valued mappings between general metric or Banach spaces. We demonstrate that these properties can be treated in the framework of the theory of (linear) error bounds for extended real-valued functions of two variables developed in A. Y. Kruger, Error bounds and metric subregularity, Optimization 64, 1 (2015) 49–79. ...
متن کاملWeak and $(-1)$-weak amenability of second dual of Banach algebras
For a Banach algebra $A$, $A''$ is $(-1)$-Weakly amenable if $A'$ is a Banach $A''$-bimodule and $H^1(A'',A')={0}$. In this paper, among other things, we study the relationships between the $(-1)$-Weakly amenability of $A''$ and the weak amenability of $A''$ or $A$. Moreover, we show that the second dual of every $C^ast$-algebra is $(-1)$-Weakly amenable.
متن کامل